|
In mathematics, a Lucas chain is a restricted type of addition chain, named for the French mathematician Édouard Lucas. It is a sequence :''a''0, ''a''1, ''a''2, ''a''3, ... that satisfies :''a''0=1, and :for each ''k'' > 0: ''a''''k'' = ''a''''i'' + ''a''''j'', and either ''a''''i'' = ''a''''j'' or |''a''''i'' − ''a''''j''| = ''a''''m'', for some ''i'', ''j'', ''m'' < ''k''.〔Guy (2004) p.169〕 The sequence of powers of 2 (1, 2, 4, 8, 16, ...) and the Fibonacci sequence (with a slight adjustment of the starting point 1, 2, 3, 5, 8, ...) are simple examples of Lucas chains. Lucas chains were introduced by Peter Montgomery in 1983.〔Kutz (2002)〕 If ''L''(''n'') is the length of the shortest Lucas chain for ''n'', then Kutz has shown that most ''n'' do not have ''L'' < (1-ε) logφ ''n'', where φ is the Golden ratio.〔 == References == * * * 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Lucas chain」の詳細全文を読む スポンサード リンク
|